Extracting Characteristics from Functional Programs for Mapping to Massively Parallel Machines
نویسندگان
چکیده
For problems with highly dynamic behavior, our experiments showed that there are speciic characteristics for diierent applications. We therefore propose a mapping environment providing several strategies for both granularity control and dynamic load balancing. For appropriate selection and parameterization of strategies, we extract the application characteristics using trace-based prooling and appropriate evaluations. Our prooling approach diiers from others in that more information (like argument sizes or the branching factor) is collected and more advanced evaluations are performed. Large real-life applications have been successfully measured, and examples demonstrate diierences in characteristics and which the corresponding strategies being appropriate are.
منابع مشابه
AData ow-basedMassivelyParallelProgrammingLanguage "V" and Its Implementation on A Stock Parallel Machine
We propose a data BLOCKINow-based massively parallel programming language, called \V," which would minimize the diculties in writing massively parallel programs. The language V has both merits of functional programming and object-based programming. Our starting point is a data BLOCKINow-based functional programming language, called \Valid," which we have developed so far, because functional pro...
متن کاملObject-Oriented Programming for Massively Parallel Machines
Large, robust massively parallel programs that are understandable (and therefore maintain-able) are not yet a reality. Such programs require a programming methodology that minimizes the conceptual diierences between the program and the domain addressed by the program, encourages reusability, and still produces robust programs that are readily maintained and reasoned about. This paper proposes t...
متن کاملA Visual Analytics System for Optimizing Communications in Massively Parallel Applications
Current and future supercomputers have tens of thousands of compute nodes interconnected with high-dimensional networks and complex network topologies for improved performance. Application developers are required to write scalable parallel programs in order to achieve high throughput on these machines. Application performance is largely determined by efficient inter-process communication. A com...
متن کاملScalable Techniques for Computing Band Linear Recurrences on Massively Parallel and Vector Supercomputers
In this paper, we present a new scalable algorithm, called the Regular Schedule, for parallel evaluation of band linear recurrences (BLR's, i.e., mth-order linear recurrences for m 1). Its scalability and simplicity make it well suited for vector supercomputers and massively parallel computers. We describe our implementation of the Regular Schedule on two types of machines: the Convex C240 and ...
متن کاملThe Illinois Concert System: Programming Support for Irregular Parallel Applications
Irregular applications are critical to supporting grand challenge applications on massively parallel machines and extending the utility of those machines beyond the scientiic computing domain. The dominant parallel programmingmodels, data parallel and explicit message passing, provide little support for programming irregular applications. We articulate a set of requirements for supporting irreg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995